Bottom-up abstract interpretation of logic programs
نویسندگان
چکیده
منابع مشابه
Efficient Bottom-Up Execution of Logic Programs Using Abstract Interpretation
B o t t o m u p evaluation of logic programs has recently at tracted much attention in the logic programming and the deductive database field. It is complete [7], and if the number of all possible facts is finite, it is guaranteed to terminate, while t op -down evaluation may not. B o t t o m u p evaluation, however, may be inefficient since it may generate many facts irrelevant to the query. T...
متن کاملAbstract Interpretation based Verification of Logic Programs
Interpretation based Verification of Logic Programs Marco Comini, Roberta Gori, Giorgio Levi, Paolo Volpe Dipartimento di Informatica Università di Pisa Pisa, Italy
متن کاملBottom up parsing as abstract interpretation of operational semantics
We show that LR(k) parsers can be represented as abstract interpretation of Shift-Reduce parser.
متن کاملDetecting Determinate Computations by Bottom-up Abstract Interpretation
This section introduces an analysis for ground and ground-deterministic dependences. Informally, a ground dependence does exist between a set of arguments T of an atom A and another argument h, iff whenever the arguments in T are ground, the refutation of A produces a set of ground bindings for h. A ground dependence is determinate, i.e. deterministic ground dependence, iff the refutation produ...
متن کاملTowards a Framework for the Abstract Interpretation of Logic Programs
A general and intuitively appealing framework is developed for the abstract interpretation of logic programs. An algorithm is given to build an abstract AND/OR tree. The algorithm uses a small set of primitive operations. Conditions for the primitive operations and the abstract domain guaranteeing termination of the algorithm and correctness of the abstract AND/OR tree are proved. The elegance ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Theoretical Computer Science
سال: 1994
ISSN: 0304-3975
DOI: 10.1016/0304-3975(94)90055-8